2-Tree probe interval graphs have a large obstruction set
نویسندگان
چکیده
منابع مشابه
2-Tree probe interval graphs have a large obstruction set
Probe interval graphs (PIGs) are used as a generalization of interval graphs in physical mapping of DNA.G= (V ,E) is a probe interval graph (PIG) with respect to a partition (P,N) ofV if vertices of G correspond to intervals on a real line and two vertices are adjacent if and only if their corresponding intervals intersect and at least one of them is in P; vertices belonging to P are called pro...
متن کامل-tree probe interval graphs have a large obstruction set
Probe interval graphs are used as a generalization of interval graphs in physical mapping of DNA. is a probe interval graph (PIG) with respect to a partition of if vertices of correspond to intervals on a real line and two vertices are adjacent if and only if their corresponding intervals intersect and at least one of them is in ; vertices belonging to are called probes and vertices belonging t...
متن کاملA characterization of 2-tree probe interval graphs
A graph is a probe interval graph if its vertices correspond to some set of intervals of the real line and can be partitioned into sets P and N so that vertices are adjacent if and only if their corresponding intervals intersect and at least one belongs to P . We characterize the 2-trees which are probe interval graphs and extend a list of forbidden induced subgraphs for such graphs created by ...
متن کاملTree coloring of distance graphs with a real interval set
Let R be the set of real numbers and D be a subset of the positive real numbers. The distance graph G(R, D) is a graph with the vertex set R and two vertices x and y are adjacent if and only if |x − y| ∈ D. In this work, the vertex arboricity (i.e., the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph) of G(R, D) is det...
متن کاملTree Spanners for Bipartite Graphs and Probe Interval Graphs1
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner problem asks whether a graph admits a tree t-spanner, given t . We first substantially strengthen the known results for bipartite graphs. We prove that the tree t-spanner problem is NP-complete even for chordal bipartite gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2005
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.06.015